Embeddings of m-cycle systems and incomplete m-cycle systems: m ⩽ 14

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Doubly near resolvable m-cycle systems

An m-cycle system C of λKn is said to be near resolvable if the mcycles in C can be partitioned into near parallel classes R1, R2, . . . , Rλn/2, each one of which is a 2-factor of λKn − v for some vertex v in λKn. If an NR(n,m, λ)-CS has a pair of orthogonal resolutions, it is said to be doubly resolvable and is denoted by DNR(n,m, λ)-CS. For m = 2, 3, DNR(n,m, 2)-CSs are known as Room frames ...

متن کامل

Further study on $(L,M)$-fuzzy topologies and $(L,M)$-fuzzy neighborhood systems

Following the idea of $L$-fuzzy neighborhood system as introduced byFu-Gui Shi, and its generalization to $(L,M)$-fuzzy neighborhood system, the relationship between  $(L,M)$-fuzzy topology and $(L,M)$-fuzzy neighborhood system will be further studied. As an application of the obtained results, we will describe the initial structures of $(L,M)$-fuzzy neighborhood subspaces and $(L,M)$-fuzzy top...

متن کامل

Cyclic m - Cycle Systems with m 32 or m 1⁄4 2 q with q a Prime Power

In this paper, the necessary and sufficient conditions for the existence of cyclic 2qcycle and m-cycle systems of the complete graph with q a prime power and 3 m 32 are given. # 2005 Wiley Periodicals, Inc. J Combin Designs 14: 66–81, 2006.

متن کامل

M m m Queue with Balking, Reneging and Additional Servers

In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...

متن کامل

ON m - COVERS AND m - SYSTEMS

Let A = {as(mod ns)}s=0 be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results related to the covering multiplicity of A. In particular, we show that if every integer lies in more than m0 = b ∑k s=1 1/nsc members of A, then for any a = 0, 1, 2, . . . there are at least ( m0 ba/n0c ) subsets I of {1, . . . , k} with ∑...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1997

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(96)00072-6